Union Bound for Linear Spa e-Time Codes

Unified design of linear space-time block codes

A number of space-time codes have been recently proposed for the quasi-static, flat-fading, multipleantenna wireless channel with coherent receiver. In this paper we will focus on design of space-time codes that are linear in the scalar input symbols. We provide design criteria that take into account both the error probability and the channel capacity. We consider the error probability via the ...

Union bound on error probability of linear space-time block codes

Design of practical coding techniques for the multiple antenna wireless channel is a challenging problem. A number of interesting solutions have been proposed recently ranging from block codes to trellis codes for the MIMO (multiple input, multiple output) channel. Here we consider linear block codes for the quasi-static, flat-fading, coherent MIMO channel. A linear code refers to an encoder th...

Optimization of Full - Rate Full - Diversity Linear Space - Time Codes using the Union Bound

– Although many space-time codes sacrifice their rate in order to achieve a high diversity order, such a sacrifice is not necessary. Recent work has reported two instances of a linear space-time code that achieves both a full rate of min(t, r) and a full diversity order of tr over a t-input r-output Rayleigh-fading channel [1][2]. We show that such full-rate full-diversity codes are plentiful a...

Spa e - Time Blo k Codes versus Spa e - Time

Generalized Union Bound for Space-Time Codes

⎯Gallager’s second bounding technique, also known as the generalized union bound, is employed to derive a new upper bound on the error probability of space-time codes with maximum-likelihood (ML) decoding on quasi-static Rayleigh fading channels. The new bound is distinguished by two characteristics: unlike the classical union bound, the new bound is rapidly convergent and is only a few decibel...